Adapting polyhedral properties from facility to hub location problems
نویسندگان
چکیده
منابع مشابه
Adapting polyhedral properties from facility to hub location problems
We examine the feasibility polyhedron of the uncapacitated hub location problem (UHL) with multiple allocation, which has applications in the elds of air passenger and cargo transportation, telecommunication and postal delivery services. In particular we determine the dimension and derive some classes of facets for this polyhedron. We develop a general rule about lifting facets from the uncapac...
متن کاملHierarchical Facility Location and Hub Network Problems: A literature review
In this paper, a complete review of published researches about hierarchical facility location and hub network problems is presented. Hierarchical network is a system where facilities with different service levels interact in a top-down way or vice versa. In Hierarchical systems, service levels are composed of different facilities. Published papers from (1970) to (2015) have been studied and a c...
متن کاملFacility Location Problems: Approximation Algorithms and Polyhedral Results
Het onderzoek beschreven in dit proefschrift is mede gefinancierd door de Technische Uni-versiteit Delft (TUDelft) and China Scholarship Council (CSC) Acknowledgements I have had a wonderful time during the past four years as a PhD student at TU Delft. This has been one of the most significant periods in my life, and would not have been possible without the support of my colleagues and friends....
متن کاملReverse facility location problems
In the Nearest Neighbor problem (NN), the objects in the database that are nearer to a given query object than any other objects in the database have to be found. In the conceptually inverse problem, Reverse Nearest Neighbor problem (RNN), objects that have the query object as their nearest neighbor have to be found. Reverse Nearest Neighbors queries have emerged as an important class of querie...
متن کاملHardness of Facility Location Problems
1.2 Hardness of k-median Theorem 1. It is hard to approximate k-median within 1+ 2 e1/c for any c < 1. This theorem is equivalent to the 1− 1/e− hardness shown in [2] and follows from a standard reduction from set cover. The main idea is to take an approximation algorithm for k-median, and use it to obtain a partial set cover. Then repeat this process, again partially covering the remaining ite...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2004
ISSN: 0166-218X
DOI: 10.1016/j.dam.2003.09.011